The Secret to Happiness

نویسندگان

  • Maya Tamir
  • Shalom H. Schwartz
  • Shige Oishi
  • Min Y. Kim
چکیده

Which emotional experiences should people pursue to optimize happiness? According to traditional subjective well-being research, the more pleasant emotions we experience, the happier we are. According to Aristotle, the more we experience the emotions we want to experience, the happier we are. We tested both predictions in a cross-cultural sample of 2,324 participants from 8 countries around the world. We assessed experienced emotions, desired emotions, and indices of well-being and depressive symptoms. Across cultures, happier people were those who more often experienced emotions they wanted to experience, whether these were pleasant (e.g., love) or unpleasant (e.g., hatred). This pattern applied even to people who wanted to feel less pleasant or more unpleasant emotions than they actually felt. Controlling for differences in experienced and desired emotions left the pattern unchanged. These findings suggest that happiness involves experiencing emotions that feel right, whether they feel good or not.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Representation of Secret in Masnavi Manavi

        Being one of the significant mystic books, Masnavi Manavi has a prominent place in presenting ontology of human being. As though by its revelation, one can reach many mystic and human concepts. Some of the important issues in this work include knowing the secret and secret keeping. The most profound place in Masnavi is where secret and secret keeping are mentioned. Molavi, himself as a...

متن کامل

Computationally secure multiple secret sharing: models, schemes, and formal security analysis

A multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants. in such a way a multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants, such that any authorized subset of participants can reconstruct the secrets. Up to now, existing MSSs either require too long shares for participants to be perfect secur...

متن کامل

An Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves

‎In a (t,n)-threshold secret sharing scheme‎, ‎a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together‎, ‎but no group of fewer than t participants can do‎. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao‎, ‎and the intractability of the elliptic curve discrete logar...

متن کامل

A Fast Publicly Verifiable Secret Sharing Scheme using Non-homogeneous Linear Recursions

A non-interactive (t,n)-publicly veriable secret sharing scheme (non-interactive (t,n)-PVSS scheme) is a (t,n)-secret sharing scheme in which anyone, not only the participants of the scheme, can verify the correctness of the produced shares without interacting with the dealer and participants. The (t,n)-PVSS schemes have found a lot of applications in cryptography because they are suitable for<...

متن کامل

Security Analysis of a Dynamic Threshold Secret Sharing Scheme Using Linear Subspace Method

A dealer-free and non-interactive dynamic threshold secret sharing scheme has been proposed by Harn et.al., in 2015. In this scheme, a (t; n) secret sharing scheme in secret reconstruction phase can turn into a (m;n) scheme in secret reconstruction phase, where m is the number of participanting shareholders. It has been claimed that the secrecy of shares and the secrecy of the secret are uncond...

متن کامل

Security Analysis of a Hash-Based Secret Sharing Scheme

Secret sharing schemes perform an important role in protecting se-cret by sharing it among multiple participants. In 1979, (t; n) threshold secret sharing schemes were proposed by Shamir and Blakley independently. In a (t; n) threshold secret sharing scheme a secret can be shared among n partic-ipants such that t or more participants can reconstruct the secret, but it can not be reconstructed b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017